Scan Statistics on Enron Graphs
نویسندگان
چکیده
We introduce a theory of scan statistics on graphs and apply the ideas to the problem of anomaly detection in a time series of Enron email graphs. Corresponding author: Carey E. Priebe =
منابع مشابه
Anomaly Detection using Scan Statistics on Time Series Hypergraphs
We present a theory of scan statistics on hypergraphs and apply the methodology to a time series of email data. This approach is of interest because a hypergraph is better suited to email data than a graph. This is due to the fact that a hypergraph can contain all the recipients of a message in a single hyperedge rather than treating each recipient separately in a graph. The result shows that s...
متن کاملStatistical inference on attributed random graphs: Fusion of graph features and content: An experiment on time series of Enron graphs
Fusion of information from graph features and content can provide superior inference for an anomaly detection task, compared to the corresponding content-only or graph featureonly statistics. In this paper, we design and execute an experiment on a time series of attributed graphs extracted from the Enron email corpus which demonstrates the benefit of fusion. The experiment is based on injecting...
متن کاملWork Hard, Play Hard: Email Classification on the Avocado and Enron Corpora
In this paper, we present an empirical study of email classification into two main categories “Business” and “Personal”. We train on the Enron email corpus, and test on the Enron and Avocado email corpora. We show that information from the email exchange networks improves the performance of classification. We represent the email exchange networks as social networks with graph structures. For th...
متن کاملOn the anomalous behaviour of a class of locality statistics
A scan statistic methodology for detecting anomalies has been developed for application to graphs, where “anomalies” are equated with vertices that exhibit distinctive local connectivity properties. We present an “anomaly graph” construction that illustrates the capabilities of these scan statistics via the behaviour of their associated locality statistics on our anomaly graphs. © 2007 Elsevier...
متن کاملA Query Based Approach for Mining Evolving Graphs
An evolving graph is a graph that can change over time. Such graphs can be applied in modelling a wide range of real-world phenomena, like computer networks, social networks and protein interaction networks. This paper addresses the novel problem of querying evolving graphs using spatio-temporal patterns. In particular, we focus on answering selection queries, which can discover evolving subgra...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Computational & Mathematical Organization Theory
دوره 11 شماره
صفحات -
تاریخ انتشار 2005